Value of Learning in Sponsored Search Auctions
نویسندگان
چکیده
The standard business model in the sponsored search marketplace is to sell click-throughs to the advertisers. This involves running an auction that allocates advertisement opportunities based on the value the advertiser is willing to pay per click, times the click-through rate of the advertiser. The click-through rate of an advertiser is the probability that if their ad is shown, it would be clicked on by the user. This quantity is unknown in advance, and is learned using historical click data about the advertiser. In this paper, we first show that in an auction that does not explore enough to discover the click-through rate of the ads, an advertiser has an incentive to increase their bid by an amount that we call value of learning. This means that in sponsored search auctions, exploration is necessary not only to improve the efficiency (a subject which has been studied in the machine learning literature), but also to improve the incentive properties of the mechanism. Secondly, we show through an intuitive theoretical argument as well as extensive simulations that a mechanism that sorts ads based on their expected value per impression plus their value of learning, increases the revenue even in the short term.
منابع مشابه
Sponsored Search Auction Design via Machine Learning∗
In this work we use techniques from the study of samplecomplexity in machine learning to reduce revenue maximizing auction problems to standard algorithmic questions. These results are particularly relevant to designing good pricing mechanisms for sponsored search. In particular we apply our results to two problems: profit maximizing combinatorial auctions, and auctions for pricing semantically...
متن کاملA truthful learning mechanism for multi-slot sponsored search auctions with externalities
In recent years, effective sponsored search auctions (SSAs) have been designed to incentivize advertisers (advs) to bid their truthful valuations and, at the same time, to assure both the advs and the auctioneer a non–negative utility. Nonetheless, when the click–through–rates (CTRs) of the advs are unknown to the auction, these mechanisms must be paired with a learning algorithm for the estima...
متن کاملMulti-unit Auctions with Budget Constraints
Motivated by sponsored search auctions, we study multi-unit auctions with budget constraints. In the mechanism we propose, Sort-Cut, understating budgets or values is weakly dominated. Since Sort-Cuts revenue is increasing in budgets and values, all kinds of equilibrium deviations from true valuations turn out to be bene cial to the auctioneer. We show that the revenue of Sort-Cut can be an or...
متن کاملTruthful Learning Mechanisms for Multi-Slot Sponsored Search Auctions with Externalities
Sponsored search auctions constitute one of the most successful applicationsof microeconomic mechanisms. In mechanism design, auctions are usuallydesigned to incentivize advertisers to bid their truthful valuations and, at thesame time, to assure both the advertisers and the auctioneer a non–negativeutility. Nonetheless, in sponsored search auctions, the click–through–rates<...
متن کاملModels for Budget Constrained Auctions: an Application to Sponsored Search & Other Auctions
Title of dissertation: MODELS FOR BUDGET CONSTRAINED AUCTIONS: AN APPLICATION TO SPONSORED SEARCH & OTHER AUCTIONS Abhishek Pani, Doctor of Philosophy, 2010 Dissertation directed by: Professor Subramanian Raghavan Robert H. Smith School of Business The last decade has seen the emergence of auction mechanisms for pricing and allocating goods on the Internet. A successful application area for auc...
متن کامل